Multifold factorizations of cyclic groups into subsets

Let $(G,+)$ be an abelian group. A finite multiset A over G is said to give a λ-fold factorization of G if there exists a multiset B over G such that each element of G occurs λ times in the multiset $A+B:=\{a+b:a\in A,b\in B\}$. In this article, restricting G to a cyclic group, we will provide sufficient conditions on a given multiset A under which the exact value or an upper bound of the minimum multiplicity λ of a factorization of G can be given by introducing a concept of ‘lcm-closure’. Furthermore, a couple of properties on a given factor A will be shown when A has a prime or prime power order (cardinality). A relation to multifold factorizations of the set of integers will be also glanced at a general perspective.     

Gray codes extending quadratic matchings

Is it true that every matching in the n-dimensional hypercube can be extended to a Gray code? More than two decades have passed since Ruskey and Savage asked this question and the problem still remains open. A solution is known only in some special cases, including perfect matchings or matchings of linear size. This article shows that the answer to the Ruskey–Savage problem is affirmative for every matching of size at most . The proof is based on an inductive construction that extends balanced matchings in the completion of the hypercube by edges of into a Hamilton cycle of . On the other hand, we show that for every there is a balanced matching in of size that cannot be extended in this way.     

Index transforms with the squares of Kelvin functions

New index transforms, involving squares of Kelvin functions, are investigated. Mapping properties and inversion formulas are established for these transforms in Lebesgue spaces. The results are applied to solve a boundary value problem on the wedge for a fourth order partial differential equation.     

On nonlinear boundary value problem corresponding to N-dimensional inverse spectral problem

We establish a relationship between an inverse optimization spectral problem for the N-dimensional Schrödinger equation $?\mathrm{\Delta }?+q(x)?=\lambda ?$ and a solution of the nonlinear boundary value problem $?\mathrm{\Delta }u+q(x)u=\lambda u?u^{\gamma ?1},u>0,u{|}_{?\mathrm{\Omega }}=0$. Using this relationship, we find an exact solution for the inverse optimization spectral problem, investigate its stability and obtain new results on the existence and uniqueness of the solution for the nonlinear boundary value problem.     

On generalized Nash equilibrium problems with linear coupling constraints and mixed-integer variables

ABSTRACT

We define and discuss different enumerative methods to compute solutions of generalized Nash equilibrium problems with linear coupling constraints and mixed-integer variables. We propose both branch-and-bound methods based on merit functions for the mixed-integer game, and branch-and-prune methods that exploit the concept of dominance to make effective cuts. We show that under mild assumptions the equilibrium set of the game is finite and we define an enumerative method to compute the whole of it. We show that our branch-and-prune method can be suitably modified in order to make a general equilibrium selection over the solution set of the mixed-integer game. We define an application in economics that can be modelled as a Nash game with linear coupling constraints and mixed-integer variables, and we adapt the branch-and-prune method to efficiently solve it.